Matching typed and untyped readability (Extended abstract)
نویسندگان
چکیده
منابع مشابه
Matching typed and untyped realizability ( Extended abstract )
Realizability interpretations of logics are given by saying what it means for computational objects of some kind to realize logical formulae. The computational objects in question might be drawn from an untyped universe of computation, such as a partial combinatory algebra, or they might be typed objects such as terms of a PCF-style programming language. In some instances, one can show that a p...
متن کاملTyped vs. Untyped Realizability
We study the domain-theoretic semantics of a Church-style typed λ-calculus with constructors, pattern matching and recursion, and show that it is closely related to the semantics of its untyped counterpart. The motivation for this study comes from program extraction from proofs via realizability where one has the choice of extracting typed or untyped terms from proofs. Our result shows that und...
متن کاملTyped Processes in Untyped Contexts
S is a print spooler serving requests from a private channel s that it communicates to its clients via the public channel d. C is one such client, that receives s and uses it to print the job j. While the intention of the specification is clear, reasoning on its properties is subtler. For instance, given the initial configuration S |C, can we prove that the jobs sent by C are eventually receive...
متن کاملExtended Initiality for Typed Abstract Syntax
Initial Semantics aims at interpreting the syntax associated to a signature as the initial object of some category of “models”, yielding induction and recursion principles for abstract syntax. Zsidó [Zsi10, Chap. 6] proves an initiality result for simply–typed syntax: given a signature S, the abstract syntax associated to S constitutes the initial object in a category of models of S in monads. ...
متن کاملAdding Algebraic Rewriting to the Untyped Lambda Calculus (Extended Abstract)
We investigate the system obtained by adding an algebraic rewriting system R to an untyped lambda calculus in which terms are formed using the function symbols from R as constants. On certain classes of terms, called here \stable", we prove that the resulting calculus is connuent if R is connuent, and terminating if R is terminating. The termination result has the corresponding theorems for sev...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2000
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(05)01205-3